Robust Euclidean Alignment of 3D Point Sets
نویسندگان
چکیده
The problem of geometric alignment of two roughly pre-registered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm 1 is presented, called the Trimmed ICP (TrICP). The new algorithm is based on the consistent use of the Least Trimmed Squares (LTS) approach in all phases of the operation. Convergence is proved and an efficient implementation is discussed. TrICP is fast, applicable to overlaps under 50%, robust to erroneous measurements and shape defects, and has easy-to-set parameters. ICP is a special case of TrICP when the overlap parameter is 100%. Results of testing the new algorithm are shown.
منابع مشابه
Fully automatic, robust and precise alignment of measured 3D surfaces for arbitrary orientations1)
We address the problem of Euclidean alignment of two partially overlapping surfaces represented by measured 3D point sets contaminated by noise and outliers. Recently, we have proposed the Trimmed Iterative Closest Point algorithm (TrICP) [3] which is fast, applicable to overlaps under 50% and robust to erroneous and incomplete measurements. In this study, we combine the precision and robustnes...
متن کاملRobust Euclidean alignment of 3D point sets: the trimmed iterative closest point algorithm
The problem of geometric alignment of two roughly pre-registered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called Trimmed ICP. The new algorithm is based on the consistent use of the Least Trimmed Squares approach in all phases of the operation. Conver...
متن کاملPre-registration of arbitrarily oriented 3D surfaces using a genetic algorithm
This paper reports on a successful application of genetic optimisation in 3D data registration. We consider the problem of Euclidean alignment of two arbitrarily oriented, partially overlapping surfaces represented by measured point sets contaminated by noise and outliers. Recently, we have proposed the Trimmed Iterative Closest Point algorithm (TrICP) [1] which is fast, applicable to overlaps ...
متن کاملمدلسازی صفحه‌ای محیط‌های داخلی با استفاده از تصاویر RGB-D
In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in f...
متن کاملبخشبندی معنادار مدل سه‌بعدی اجسام بر اساس استخراج برجستگی‌ها و هسته جسم
3D model segmentation has an important role in 3D model processing programs such as retrieval, compression and watermarking. In this paper, a new 3D model segmentation algorithm is proposed. Cognitive science research introduces 3D object decomposition as a way of object analysis and detection with human. There are two general types of segments which are obtained from decomposition based on thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002